Optimization of SISO Decoding for Hamming Codes
نویسندگان
چکیده
In this paper, we introduce the optimization of SISO(Soft-Input SoftOutput) decoding for Hamming code which is well known as linear block code. When the problem that the output value becomes infitity during SISO decoding of Hamming code occurs, it is resolved by entering an appropriate value between 1 and 2 which is obtained through the experiment in the decoder. The simulation result has shown that almost the same BER performance could be obtained over AWGN channel environment when compared to the conventional MLD(Maximum Likelihood Decoding) decoding method.
منابع مشابه
Heuristics for Optimizing in Complexity SISO Trellis-Based Decoding of Linear Block Codes
RésuméUn problème important qui se pose lors du décodage des codes linéaires en blocs par l’algorithme Forward-Backward (FB) est de trouver une permutation des coordonnées qui minimise la complexité de branches des treillis associés aux codes. Dans cet article, des heuristiques sont proposées. Nous fournissons une table récapitulative des résultats obtenus pour de nombreux codes et les comparon...
متن کاملIterative Decoding Algorithms for Turbo Product Codes
In this paper we introduce the iterative decoding principle, “the turbo principle”, for the bidimensional Turbo Product Codes (TPC’s). The constituent codes used for encoding on rows and columns are two concatenated (7,4) Hamming block codes. Several Soft Input Soft Output (SISO) algorithms can be used for the iterative decoding process. At each iteration, the two decoders decode all rows, then...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملDuality of Channel Encoding and Decoding - Part I: Rate-1 Convolutional Codes
In this paper, we revisit the forward, backward and bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-input soft-output (SISO) maximum a posteriori probability (MAP) decoding process of rate-1 convolutional codes. From this we establish some interesting duality properties between encoding and decoding of rate-1 convolutional codes. We observe that the forward and backward BCJR SISO MAP decoder...
متن کامل